Global Routing in VLSI Design: Algorithms, Theory, and Computational Practice
نویسندگان
چکیده
Global routing in VLSI (very large scale integration) design is one of the most challenging discrete optimization problems in computational theory and practice. In this paper, we present a polynomial time algorithm for the global routing problem based on an integer programming formulation. The algorithm features a theoretical approximation bound while ensuring all the routing demands are concurrently satisfied. We provide both a serial and a parallel implementation as well as develop several heuristics to improve the quality of the solution and reduce running time. Our computational results on a well-known benchmark set show that, combined with certain heuristics, our new algorithms perform extremely well compared with other integer programming approaches.
منابع مشابه
Advanced Optimization Laboratory Title : Global Routing in VLSI Design : Algorithms , Theory , and Computational Practice
Global routing in VLSI (very large scale integration) design is one of the most challenging discrete optimization problems in computational theory and practice. In this paper, we present a polynomial time algorithm for the global routing problem based on integer programming formulation with a theoretical approximation bound. The algorithm ensures that all routing demands are satisfied concurren...
متن کاملAn Effective Memetic Algorithm for Solving Channel Routing Problems
The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor p lanning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections between blocks or cells, respectively, have to be ge...
متن کاملAlgorithms for the scaling toward nanometer VLSI physical synthesis
Algorithms for the Scaling Toward Nanometer VLSI Physical Synthesis. (December 2005) Chin Ngai Sze, B.Eng., The Chinese University of Hong Kong; M.Phil., The Chinese University of Hong Kong Chair of Advisory Committee: Dr. Jiang Hu Along the history of Very Large Scale Integration (VLSI), we have successfully scaled down the size of transistors, scaled up the speed of integrated circuits (IC) a...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملA Multiple-objective based Hierarchical Global Routing Approach for VLSI ASIC Design
A VLSI chip can today contain hundreds of millions transistors and is expected to contain more than 1 billion transistors in the next decade. In order to handle this rapid growth in integration technology, the design procedure is therefore divided into a sequence of design steps. Circuit layout is the design step in which a physical realization of a circuit is obtained from its functional descr...
متن کامل